Semantics of MML Query - Ordering

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semantics of MML Query - Ordering

In this paper X denotes a set, R, R1, R2 denote binary relations, x, y, z denote sets, and n, m, k denote natural numbers. Let us consider a binary relation R on X. Now we state the propositions: (1) fieldR ⊆ X. (2) If x, y ∈ R, then x, y ∈ X. Now we state the propositions: (3) Let us consider sets X, Y . Then (idX)Y = X ∩ Y . (4) 〈x, y〉 ∈ R |2 X if and only if x, y ∈ X and 〈x, y〉 ∈ R. (5) dom(...

متن کامل

An Action Semantics for MML

This paper describes an action semantics for UML based on the Meta-Modelling Language (MML) a precise meta-modelling language designed for developing families of UML languages. Actions are defined as computational procedures with side-effects. The action semantics are described in the MML style, with model, instance and semantic packages. Different actions are described as specializations of th...

متن کامل

Information Retrieval and Rendering with MML Query

Mizar, a proof-checking system, is used to build the Mizar Mathematical Library (MML). MML Query is a semantics-based tool for searching, browsing and presentation of the evolving MML content. The tool is becoming widely used as an aid for Mizar authors and plays an essential role in the ongoing reorganization of MML. We present new features of MML Query implemented in the third release and des...

متن کامل

Interleaving based Partial Ordering Semantics

This paper present a partial ordering semantics for process calculi. The semantics is deened in SOS style and it is based on transition systems. We adopt proved transition system, whose transitions are labelled with encodings of their proofs and whose nodes are the same of the classical interleaving semantics. Relabelling functions are deened to retrive causal models that can take generation or...

متن کامل

The semantics of query modification

We present a method that exploits ‘linked data’ to determine semantic relations between consecutive user queries. Our method maps queries onto concepts in linked data and searches the linked data graph for direct or indirect relations between the concepts. By comparing relations between large numbers of user queries, we identify semantic modification patterns. The application of this method to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formalized Mathematics

سال: 2013

ISSN: 1898-9934,1426-2630

DOI: 10.2478/forma-2013-0004